Synchronization and balancing on the N-torus

In this paper, we study the behavior of a network of N agents, each evolving on the circle. We propose a novel algorithm that achieves synchronization or balancing in phase models under weak connectedness assumptions on the (possibly time-varying and unidirectional) communication graphs. The global convergence analysis on the N -torus is a distinctive feature of the present work with respect to previous results that have focused on convergence in the Euclidean space.